Economic lot-sizing problem with remanufacturing option: complexity and algorithms

Abstract In a single item dynamic lot-sizing problem, we are given time horizon and demand for in every period. The problem seeks solution that determines how much to produce carry at each period, so will incur the least amount of production inventory cost. When remanufacturing option is included, input comprises number returned products period can be potentially remanufactured satisfy demands, where costs applicable. For this first show it cannot have fully polynomial approximation scheme. We then provide algorithm, when make certain realistic assumptions on cost structure.